Loop Spaces and Iterated Higher Dimensional Enrichment

نویسندگان

  • STEFAN FORCEY
  • Frank Quinn
  • William Floyd
  • Edward Green
  • Stefan Forcey
چکیده

There is an ongoing massive effort by many researchers to link category theory and geometry, especially homotopy coherence and categorical coherence. This constitutes just a part of the broad undertaking known as categorification as described by Baez and Dolan. This effort has as a partial goal that of understanding the categories and functors that correspond to loop spaces and their associated topological functors. Progress towards this goal has been advanced greatly by the recent work of Balteanu, Fiedorowicz, Schwänzl, and Vogt who show a direct correspondence between k–fold monoidal categories and k–fold loop spaces through the categorical nerve. This thesis pursues the hints of a categorical delooping that are suggested when enrichment is iterated. At each stage of successive enrichments, the number of monoidal products seems to decrease and the categorical dimension to increase, both by one. This is mirrored by topology. When we consider the loop space of a topological space, we see that paths (or 1–cells) in the original are now points (or objects) in the derived space. There is also automatically a product structure on the points in the derived space, where multiplication is given by concatenation of loops. Delooping is the inverse functor here, and thus involves shifting objects to the status of 1–cells and decreasing the number of ways to multiply. Enriching over the category of categories enriched over a monoidal category is defined, for the case of symmetric categories, in the paper on A∞–categories by Lyubashenko. It seems that it is a good idea to generalize his definition first to the case of an iterated monoidal base category and then to define V–(n + 1)–categories as categories enriched over V–n–Cat, the (k−n)–fold monoidal strict (n+1)–category of V–n–categories where k < n ∈ N. We show that for V k–fold monoidal the structure of a (k−n)–fold monoidal strict (n+ 1)–category is possessed by V–n–Cat. iii

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Enrichment as Categorical Delooping I: Enrichment Over Iterated Monoidal Categories

Joyal and Street note in their paper on braided monoidal categories [10] that the 2–category V–Cat of categories enriched over a braided monoidal category V is not itself braided in any way that is based upon the braiding of V. What is meant by “based upon” here will be made more clear in the present paper. The exception that they mention is the case in which V is symmetric, which leads to V–Ca...

متن کامل

Enrichment over iterated monoidal categories

Joyal and Street note in their paper on braided monoidal categories [9] that the 2–category V –Cat of categories enriched over a braided monoidal category V is not itself braided in any way that is based upon the braiding of V . The exception that they mention is the case in which V is symmetric, which leads to V –Cat being symmetric as well. The symmetry in V –Cat is based upon the symmetry of...

متن کامل

Iterated Wreath Product of the Simplex Category and Iterated Loop Spaces

Generalising Segal’s approach to 1-fold loop spaces, the homotopy theory of n-fold loop spaces is shown to be equivalent to the homotopy theory of reduced Θn-spaces, where Θn is an iterated wreath-product of the simplex category ∆. A sequence of functors from Θn to Γ allows for an alternative description of the Segal-spectrum associated to a Γ-space. In particular, each Eilenberg-MacLane space ...

متن کامل

Cellular structures for En-operads

Initially, the interest in iterated loop spaces arose from homotopy theory, more precisely from the fact that several important classifying spaces were known to be infinite loop spaces. In Peter May’s theory of En-operads [20], the recognition principle for n-fold iterated loop spaces is based on the approximation theorem which (in its crude form) states that (for a connected, well pointed spac...

متن کامل

Iterated Local Search Algorithm for the Constrained Two-Dimensional Non-Guillotine Cutting Problem

An Iterated Local Search method for the constrained two-dimensional non-guillotine cutting problem is presented. This problem consists in cutting pieces from a large stock rectangle to maximize the total value of pieces cut. In this problem, we take into account restrictions on the number of pieces of each size required to be cut. It can be classified as 2D-SLOPP (two dimensional single large o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004